Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

g(x, a, b) → g(b, b, a)

Q is empty.


↳ QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g(x, a, b) → g(b, b, a)

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:
[g3, b] > a

Status:
b: multiset
a: multiset
g3: [3,1,2]